Building Random Trees from Blocks
نویسندگان
چکیده
Many modern networks grow from blocks. We study the probabilistic behavior of parameters of a blocks tree, which models several kinds of networks. It grows from building blocks that are themselves rooted trees. We investigate the number of leaves, depth of nodes, total path length, and height of such trees. We use methods from the theory of Pólya urns and martingales.
منابع مشابه
Random Graphs from a Block Class
A block class is a class of graphs such that a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most random n-vertex graphs in such a class, each vertex is in at most (1+o(1)) log n/ log logn blocks, and each path passes through at most 5(n log n) blocks. Further, these results remain true when we condition on the numbers of components and blocks, and ...
متن کاملUse of Evolutionary Hypernetworks for Mining Prostate Cancer Data
Hypernetwork models have been proposed as a random graph model of learning and memory inspired by biomolecular networks in the cell. The hypergraph structure of the hypernetworks turned out to be very useful for discovering the building blocks of higher-order interaction of multiple variables. Here we use the hypernetwork model for the analysis of microarray data for cancer diagnosis. Tested on...
متن کاملCurrent Mode Multiple-Valued Adder Tree Design for High Performance Arithmetic Applications
Adder trees are the crucial design blocks of many arithmetic VLSI circuits. Alternative implementations can solve the large area requirements and complicated interconnection scheme of these building blocks. Multiple Valued Logic (MVL) implementation of an adder tree can be an alternative design style, which can save from area and interconnect.
متن کاملProgrammable disorder in random DNA tilings.
Scaling up the complexity and diversity of synthetic molecular structures will require strategies that exploit the inherent stochasticity of molecular systems in a controlled fashion. Here we demonstrate a framework for programming random DNA tilings and show how to control the properties of global patterns through simple, local rules. We constructed three general forms of planar network-random...
متن کاملHow Much Information is Needed to Infer Reticulate Evolutionary Histories?
Phylogenetic networks are a generalization of evolutionary trees and are an important tool for analyzing reticulate evolutionary histories. Recently, there has been great interest in developing new methods to construct rooted phylogenetic networks, that is, networks whose internal vertices correspond to hypothetical ancestors, whose leaves correspond to sampled taxa, and in which vertices with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013